Taguchi dynamic analysis application to computer tomography number-mass density linear dependence optimization
نویسندگان
چکیده
منابع مشابه
Stress Analysis of the Human Ligamentous Lumber Spine-From Computer-Assisted Tomography to Finite Element Analysis
Detailed investigation on biomechanics of a complex structure such as the human lumbar spine requires the use of advanced computer-based technique for both the geometrical reconstruction and the stress analysis. In the present study, the computer-assisted tomography (CAT) and finite element method (FEM) are merged to perform detailed three dimensional nonlinear analysis of the human ligamentous...
متن کاملCellular Genetic Algorithm with Density Dependence for Dynamic Optimization Problems
For dynamic optimization problems, the aim of an effective optimization algorithm is both to find the optimal solutions and to track the optima over time. In this paper, we advanced two kinds of cellular genetic algorithms inspired by the density dependence scheme in ecological system to solving dynamic optimization problems. Two kinds of improved evolution rules are proposed to replace the rul...
متن کاملTaguchi and Robust Optimization
This report is intended to facilitate dialogue between engineers and optimizers about the eeciency of Taguchi methods for robust design, especially in the context of design by computer simulation. Three approaches to robust design are described: 1. Robust optimization, i.e. specifying an objective function f and then minimizing a smoothed (robust) version of f by the methods of numerical optimi...
متن کاملDensity Matrix From Photon Number Tomography
We provide a simple analytic relation which connects the density operator of the radiation field with the number probabilities. The problem of experimentally ”sampling” a general matrix elements is studied, and the deleterious effects of nonunit quantum efficiency in the detection process are analyzed showing how they can be reduced by using the squeezing technique. The obtained result is parti...
متن کاملDynamic Bundle Methods Application to Combinatorial Optimization
Lagrangian relaxation is a popular technique to solve difficult optimization problems. However, the applicability of this technique depends on having a relatively low number of hard constraints to dualize. When there are exponentially many hard constraints, it is preferable to relax them dynamically, according to some rule depending on which multipliers are active. For instance, only the most v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Assisted Surgery
سال: 2017
ISSN: 2469-9322
DOI: 10.1080/24699322.2017.1378791